// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
struct stu
{
	string s;
	int y,m,d,n;
};
bool cmp(stu a,stu b)
{
	if(a.y<b.y)return 1;
	else if(a.y==b.y)
	{
		if(a.m<b.m)return 1;
		else if(a.m==b.m)
		{
			if(a.d<b.d)return 1;
			else if(a.d==b.d)
			{
				if(a.n>b.n)return 1;
			}
		}
	}
	return 0;
}
signed main()
{
	int n;
	cin>>n;
	vector<stu> v(n);
	for(int i=0;i<n;i++)
	{
		cin>>v[i].s>>v[i].y>>v[i].m>>v[i].d;
		v[i].n=i;
	}
	sort(v.begin(),v.end(),cmp);
	for(int i=0;i<n;i++)
	{
		cout<<v[i].s<<endl;
	}
	return 0;
}
